DETERMINATION OF OPTIMAL WORK START TIME

Optimal Commuting and Work Start Time Distributions under Flexible Work Hours System considering Modal Split between Automobile and Railroad*

近年,通 勤混雑 の緩和 策 として,交 通需要管理(TDM) 施策が着 目されてい る.中 で も通勤需要を時間的に分散 させ る施策の有効性が確かめ られ,フ レックスタイム制 度は徐 々に浸透 しつつ ある1).フ レックスタイム制度 の 評価 をす る際には,混 雑の外部不経済性の緩 和効果だけ に着 目す るのではな く,労 働時間帯のずれに よる業務 活 動の効率低下,す なわ ち時間的集積の経済性 への悪影 響 を考慮す る必要が ある.筆 者 らは これ まで,始 業時刻変 更 による業務活動の効率低下 の影響 を考慮 した通勤 ・始 業時刻分布 を分析で きる理論モデル を構築 し,フ レック スタイム制度 の経済評価 を行った2),3).し か しなが ら,こ れ らの分析では大都市圏 中心部の通勤鉄道や地方都市の 自動車通勤 を念頭 に置 いた単一モー ドの下で...

C-start: optimal start of larval fish

We investigate the C-start escape response of larval fish by combining flow simulations using remeshed vortex methods with an evolutionary optimization. We test the hypothesis of the optimality of C-start of larval fish by simulations of larval-shaped, twoand three-dimensional self-propelled swimmers. We optimize for the distance travelled by the swimmer during its initial bout, bounding the sh...

If you haven't published your work, it's time to start.

Work - Time Optimal Parallel Pre x Matching

Consider the preex matching problem: Given a pattern P of length m and a text T of length n, nd for all positions i in T the longest preex of P starting at i. We present a parallel algorithm for the preex matching problem over general alphabets whose text search takes optimal O((m)) time and preprocessing takes optimal O(log log m) time, where (m) is the inverse Ackermann function. An (log log ...

On Start Point Selection for Time-Optimal System Design Algorithm

On the basis of generalized theory of system design the behavior of the different design trajectories in the design phase space was analyzed. The problem of the initial point selection for the time-optimal algorithm construction was connected with the discovering of an additional acceleration effect of design process. This acceleration effect has been discovered by the analysis of various desig...